Abstract for ITA
نویسنده
چکیده
A cluster of network nodes utilizing Slepian-Wolf distributed source coding is considered. Under energy constraints in the nodes, a low complexity algorithm to find the optimal configuration (including source coding rates and transmit durations) maximizing the number of samples collected by the cluster is proposed. Exact closed form solutions are derived when the fusion center is not energy constrained. In presence of an energy constraint for the fusion center, an approximate linear programming formulation is obtained. A near-optimal solution is then derived for some special cases. Numerical results demonstrate that the proposed algorithms show significant gain.
منابع مشابه
Intrathecal Analgesia Versus Non-analgesia in Labor on Maternal and Neonatal Outcomes
Aims: Spinal analgesia is the most common method that provides pain relief during labor and controversy exists about its effect on the maternal and fetal among the women. This study was conducted to determine the effect of intrathecal analgesia (ITA) on perineal laceration, duration of the first, second, and third stage of labor, and Apgar score. Materials & Methods: Fifty primipara parturien...
متن کاملA Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
We show that the termination of Mohri’s algorithm is decidable for polynomially ambiguous weighted finite automata over the tropical semiring which gives a partial answer to a question by Mohri [29]. The proof relies on an improvement of the notion of the twins property and a Burnside type characterization for the finiteness of the set of states produced by Mohri’s algorithm. ∗An extended abstr...
متن کاملCompositional characterization of observable program properties
In this paper we model both program behaviours and abstractions between them as lax functors, which generalize abstract interpretations by exploiting the natural ordering of program properties. This generalization provides a framework in which correctness (safety) and completeness of abstract interpretations naturally arise from this order. Furthermore, it supports modular and stepwise reenemen...
متن کاملNondeterminism and Fully Abstract Models
— We study the semantics ofsome nondeterministic languages derivedfrom PCF [8]. In particular we discuss how Milner" s results in [5] can (or cannoi) be applied to obtain models,for our languages, which arefully abstract with respect to the (standard) operational semantics. Résumé. — Nous étudions ici la sémantique de quelques langages non déterministes, dérivés du PCF [8]. En particulier, nous...
متن کاملAn abstract monadic semantics for value recursion
This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics ...
متن کاملCoalgebras for Binary Methods: Properties of Bisimulations and Invariants
COALGEBRAS FOR BINARY METHODS: PROPERTIES OF BISIMULATIONS AND INVARIANTS HENDRIK TEWS 1 Abstract. Coalgebras for endofunctors C C can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors Cop C C . This extension allows t...
متن کامل